#include <stdio.h>
#include "tree_1.h"
void print_cb(int val) {
	printf("%d ", val);
}
int main() {
	tree tr = {0};
	tree_init(&tr);
	tree_insert(&tr, 50);
	tree_insert(&tr, 25);
	tree_insert(&tr, 75);
	tree_insert(&tr, 13);
	tree_insert(&tr, 37);
	tree_insert(&tr, 67);
	tree_insert(&tr, 88);
	tree_insert(&tr, 7);
	tree_miter(&tr, print_cb);	//把有序二叉树里的所有数字按照从小到达的顺序显示在屏幕
	printf("\n");
	tree_deinit(&tr);
	return 0;
}
